Fundamental Requirements for Primary Visual Perception
نویسندگان
چکیده
منابع مشابه
On the emergence of primary visual perception.
We propose a concise novel conceptual and biological framework for the analysis of primary visual perception (PVP) that refers to the most basic levels of our awake subjective visual experiences. Neural representations for image content elaborated within V1/V2 and the early occipitotemporal (ventral) loop remain only latent with respect to PVP until spatially localized with respect to an attend...
متن کاملVisual perception: Spotlight on the primary visual cortex
The way we see the world is as much a reflection of our interpretation of the sensory input — the retinal image — as it is a truthful representation of the real world. Spatial attention, in particular, serves to accentuate objects or locations of interest, while a large amount of visual information is continually discarded. The role spatial attention plays in target detection is classically ill...
متن کاملNeural mechanisms for color perception in the primary visual cortex.
New neurophysiological results show the existence of multiple transformations of color signals in the primary visual cortex (V1) in macaque monkey. These different color mechanisms may contribute separately to the perception of color boundaries and colored regions. Many cells in V1 respond to color and to black-white (luminance) patterns. These neurons are spatially selective and could provide ...
متن کاملFundamental Graphical Primitives for Visual
The need of a friendly man-machine interaction is becoming crucial for a large variety of applications. In order to reach such a friendliness a new class of languages has been proposed (Visual Languages), based on the extensive use of graphical and iconic mechanisms. We are interested in a particular subclass of Visual Languages, called Visual Query Languages (VQLs), devoted to the extraction o...
متن کاملAlgorithms and Resource Requirements for Fundamental Problems
We establish more efficient methods for solving interesting classes of NP-hard problems exactly, as well as methods for proving limitations on how quickly those and other problems can be solved. • On the negative side, we prove that a number of NP-hard problems cannot be solved too efficiently by algorithms that only use a small amount of additional workspace. Building on prior work in the area...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cerebral Cortex
سال: 2007
ISSN: 1047-3211,1460-2199
DOI: 10.1093/cercor/bhm226